Analysis of multiserver retrial queueing system: A martingale approach and an algorithm of solution

نویسنده

  • Vyacheslav M. Abramov
چکیده

The paper studies a multiserver retrial queueing system with m servers. Arrival process is a point process with strictly stationary and ergodic increments. A customer arriving to the system occupies one of the free servers. If upon arrival all servers are busy, then the customer goes to the secondary queue, orbit, and after some random time retries more and more to occupy a server. A service time of each customer is exponentially distributed random variable with parameter μ1. A time between retrials is exponentially distributed with parameter μ2 for each customer. Using a martingale approach the paper provides an analysis of this system. The paper establishes the stability condition and studies a behavior of the limiting queue-length distributions as μ2 increases to infinity. As μ2 → ∞, the paper also proves the convergence of appropriate queue-length distributions to those of the associated ‘usual’ multiserver queueing system without retrials. An algorithm for numerical solution of the equations, associated with the limiting queue-length distribution of retrial systems, is provided.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiserver Queueing Systems with Retrials and Losses

The interest in retrial queueing systems mainly lies in their application to telephone systems. This paper studies multiserver retrial queueing systems with n servers. The arrival process is a quite general point process. An arriving customer occupies one of the free servers. If upon arrival all servers are busy, then the customer waits for his service in orbit, and after a random time retries ...

متن کامل

Multiserver Queueing Systems with Retrials and Abandonments and Their Application to Call Centers

The paper studies multiserver retrial queueing systems with m servers. Arrival process is a quite general point process. An arriving customer occupies one of free servers. If upon arrival all servers are busy, then the customer waits for his service in orbit, and after random time retries more and more to occupy a server. The orbit has one waiting space only, and arriving customer, who finds al...

متن کامل

Multiserver Retrial Queues with Finite Number of Heterogeneous Sources∗

The aim of this paper is to investigate a multiserver retrial queueing system with a finite number of heterogeneous sources of calls. The novelty of the investigation is the heterogeneity of the sources, that is every source is characterized by different arrival, retrial and service rates. All random variables involved in the model construction are assumed to be exponentially distributed and in...

متن کامل

Standard and Retrial Queueing Systems: a Comparative Analysis

We describe main models and results of a new branch of the queueing theory, theory of retrial queues, which is characterized by the following basic assumption: a customer who cannot get service (due to finite capacity of the system, balking, impatience, etc.) leaves the service area, but after some random delay returns to the system again. Emphasis is done on comparison with standard queues wit...

متن کامل

Asymptotic and Numerical Analysis of Multiserver Retrial Queue with Guard Channel for Cellular Networks

This paper considers a retrial queueing model for a base station in cellular networks where fresh calls and handover calls are available. Fresh calls are initiated from the cell of the base station. On the other hand, a handover call has been connecting to a base station and moves to another one. In order to keep the continuation of the communication, it is desired that an available channel in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Annals OR

دوره 141  شماره 

صفحات  -

تاریخ انتشار 2006